Random entropy and recurrence
نویسندگان
چکیده
منابع مشابه
Random Entropy and Recurrence
1. Motivation and introduction. In [1], the concept of random entropy associated with a Zd random group action was introduced and studied. Every such Zd random group action is generated via a cocycle. (For the readers with a probabilistic background, a cocycle is a generalization of an ordinary random walk, the main difference being the fact that cocycles are generally indexed by Zd rather than...
متن کاملEntropy of weighted recurrence plots.
The Shannon entropy of a time series is a standard measure to assess the complexity of a dynamical process and can be used to quantify transitions between different dynamical regimes. An alternative way of quantifying complexity is based on state recurrences, such as those available in recurrence quantification analysis. Although varying definitions for recurrence-based entropies have been sugg...
متن کاملChain Recurrence Rates and Topological Entropy
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the wellknown notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of chain transitive maps. These notions of recurrence are defined using ε-chains, and the minimal lengths of these ε-chains give a way to measure recurrence time (...
متن کاملRandom Recurrence Equations
We develop sharp large deviation asymptotics for the probability of ruin in a Markov-dependent stochastic economic environment and study the extremes for some related Markovian processes which arise in financial and insurance mathematics, related to perpetuities and the ARCH(1) and GARCH(1,1) time series models. Our results build upon work of Goldie [Ann. Appl. Probab. 1 (1991) 126–166], who ha...
متن کاملRecurrence for Random
This paper is a first step in the study of the recurrence behavior in random dynamical systems and randomly perturbed dynamical systems. In particular we define a concept of quenched and annealed return times for systems generated by the composition of random maps. We moreover prove that for super-polynomially mixing systems, the random recurrence rate is equal to the local dimension of the sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2003
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171203212217